NETWORK SIMPLEX ALGORITHM ASSOCIATED WITH THE MAXIMUM FLOW PROBLEM
نویسندگان
چکیده
منابع مشابه
Network Simplex Algorithm associated with the Maximum Flow Problem
In the present paper, we apply the network simplex algorithm for solving the minimum cost flow problem, to the maximum flow problem. Then we prove that the cycling phenomenon which causes the infinite loop in the algorithm, does not occur in the network simplex algorithm associated with the maximum flow problem.
متن کاملUse of dynamic trees in a network simplex algorithm for the maximum flow problem
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on an n-vertex, m-arc network in at most nm pivots and O(nZm) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm log n). This bound is less than a loga...
متن کاملAlgorithm for Fuzzy Maximum Flow Problem in Hyper-Network Setting
Maximum flow problem on hypergraphs (hyper-networks) is an extension of maximum flow problem on normal graphs. In this paper, we consider a generalized fuzzy version of maximum flow problem in hyper-networks setting. Our algorithm is a class of genetic algorithms and based on genetic tricks. The crisp equivalents of fuzzy chance constraints in hyper-networks setting are defined, and the executi...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
We introduce an algorithm that solves the maximum ow problem without generating ows explicitly The algorithm solves di rectly a problem we call the maximum s excess problem That problem is equivalent to the minimum cut problem and is a direct extension of the maximum closure problem The concepts used also lead to a new parametric analysis algorithm generating all breakpoints in the amount of ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Far East Journal of Mathematical Sciences (FJMS)
سال: 2018
ISSN: 0972-0871
DOI: 10.17654/ms104010119